Fast Parallel Molecular Solution for Longest and Shortest Paths with Forbidden Pairs

نویسندگان

  • Mahsa Hakimi
  • Akbar Moazzam
  • Babak Dalvand
  • Mehdi S Haghighat
  • Ahmed A. Sallam
  • Ardashir Dolati
چکیده

Adleman demonstrate that we can deoxyribonucleic acid (DNA) strands to solve an instance of the Hamiltonian path problem (HPP). One year later, Lipton solved another NP hard problem. In this paper, we use this model for developing a new DNA algorithm to solve longest and shortest path with forbidden pairs. Our algorithm works in polynomial time.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Molecular Computing Solutions of some Classical Problems

In this paper we give efficient molecular computing solutions to seven well-known NP-complete problems, namely the Hamiltonian circuit, Path with forbidden pairs, Longest path, Monochromatic triangle, Partition into triangles, Partition into paths of length two, Circuit satisfiability problems in the Parallel filtering model of Amos et al.

متن کامل

Solutions of some Classical Problems in Various Theoretical DNA Computing Models

In this work we give efficient molecular computing solutions to eight well-known NP-complete problems, namely the Hamiltonian circuit, Longest path, Longest circuit, Path with forbidden pairs, Monochromatic triangle, Partition into triangles, Partition into paths of length two and Circuit satisfiability problems in the Parallel filtering model of Amos et al. We also show that this model can be ...

متن کامل

NC Algorithms for the Single Most Vital Edge Problem with Respect to All Pairs Shortest Paths

For a weighted, undirected graph G = (V;E) where jV j = n and jEj = m, we examine the single most vital edge with respect to two measurements related to all-pairs shortest paths (APSP). The rst measurement considers only the impact of the removal of a single edge from the APSP on the shortest distance between each vertex pair. The second considers the total weight of all the edges which make up...

متن کامل

First record of karyotype analysis in Anjak, Schizocypris altidorsalis (Bianco and Banarescu, 1982) from Hamoun Lake, Iran

The chromosomal spread and karyotype of Anjak (Schizocypris altidorsalis) from Hamoun Lake were determined using tissue squashing techniques with an injection of 1 mL/100 g body weight of 0.01% colchicines solution. Kidney and gill epithelia tissues were removed and used for karyotype analysis. The analysis of 145 chromosome spreads revealed the diploid chromosome number of this fish, 2n=48 and...

متن کامل

A bi-objective model for a scheduling problem of unrelated parallel batch processing machines with fuzzy parameters by two fuzzy multi-objective meta-heuristics

This paper considers a bi-objective model for a scheduling problem of unrelated parallel batch processing machines to minimize the makespan and maximum tardiness, simultaneously. Each job has a specific size and the data corresponding to its ready time, due date and processing time-dependent machine are uncertain and determined by trapezoidal fuzzy numbers. Each machine has a specific capacity,...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2017